System for automated resource transfer processing using a distributed server network

ABSTRACT

A system provides automated resource transfer processing using a distributed server network. In particular, the system may comprise a distributed database of data records relating to resource transfers which may be accessible by authorized users and/or entities. The distributed database may further comprise executable code which may be submitted and/or approved by the authorized users and/or entities before being deployed to the distributed database. Once deployed, the system may automatically execute the executable code upon detecting the existence of certain triggers, thereby enabling the system to efficiently resolve the steps in the resource transfer process on behalf of multiple disparate entities.

FIELD OF THE INVENTION

The present disclosure embraces a system for automated resource transferprocessing using a distributed server network.

BACKGROUND

There is a need for an efficient and accurate way to automate resourcetransfer processes.

BRIEF SUMMARY

The following presents a simplified summary of one or more embodimentsof the invention in order to provide a basic understanding of suchembodiments. This summary is not an extensive overview of allcontemplated embodiments, and is intended to neither identify key orcritical elements of all embodiments, nor delineate the scope of any orall embodiments. Its sole purpose is to present some concepts of one ormore embodiments in a simplified form as a prelude to the more detaileddescription that is presented later.

The present disclosure is directed to a system for automated resourcetransfer processing using a distributed server network. In particular,the system may comprise a distributed database of data records relatingto resource transfers which may be accessible by authorized users and/orentities. The distributed database may further comprise executable codewhich may be submitted and/or approved by the authorized users and/orentities before being deployed to the distributed database. Oncedeployed, the system may automatically execute the executable code upondetecting the existence of certain triggers, thereby enabling the systemto efficiently resolve the steps in the resource transfer process onbehalf of multiple disparate entities.

Accordingly, embodiments of the present disclosure provide a system forperforming resource transfers using a distributed server. The system maycomprise a memory device with computer-readable program code storedthereon; a communication device; and a processing device operativelycoupled to the memory device and the communication device. Theprocessing device may be configured to execute the computer-readableprogram code to detect that a first set of conditions has triggered afirst set of executable code; automatically execute the first set ofexecutable code to transmit a resource transfer request to a secondentity; detect a transfer of an amount of resources from the secondentity to a first entity; detect that a second set of conditions hastriggered a second set of executable code; and automatically execute thesecond set of executable code to transfer a first allocation of theamount of resources from the first entity to a third entity.

In some embodiments, the distributed server hosts a distributed ledger.In such embodiments, the computer-readable program code may furthercause the processing device to submit a request to add a third set ofexecutable code to the distributed ledger; validate the third set ofexecutable code; receive validation of the third set of executable codefrom a second entity node; receive validation of the third set ofexecutable code from a third entity node; and deploy the third set ofexecutable code to the distributed ledger.

In some embodiments, the distributed ledger is a channel-dependentchained repository, wherein data records of the distributed ledger areassigned to a first private channel.

In some embodiments, automatically executing the second set ofexecutable code further comprises transferring a second allocation ofthe amount of resources from the first entity to a fourth entity.

In some embodiments, the computer-readable program code further causesthe processing device to provide authorized access of the distributedserver to a non-related third-party entity.

In some embodiments, the distributed server hosts a distributed ledger,wherein the first set of executable code and the second set ofexecutable code are deployed to the distributed ledger as smartcontracts.

In some embodiments, the first set of conditions comprises a securityterm.

In some embodiments, the second set of conditions comprises receipt ofthe amount of resources by the first entity.

Embodiments of the present disclosure also provide a computer programproduct for performing resource transfers using a distributed server.The computer program product may comprise at least one non-transitorycomputer readable medium having computer-readable program code portionsembodied therein, the computer-readable program code portions comprisingexecutable code portions for detecting that a first set of conditionshas triggered a first set of executable code; automatically executingthe first set of executable code to transmit a resource transfer requestto a second entity; detecting a transfer of an amount of resources fromthe second entity to a first entity; detecting that a second set ofconditions has triggered a second set of executable code; andautomatically executing the second set of executable code to transfer afirst allocation of the amount of resources from the first entity to athird entity.

In some embodiments, the distributed server hosts a distributed ledger.In such embodiments, the computer-readable program code portions mayfurther comprise executable code portions for submitting a request toadd a third set of executable code to the distributed ledger; validatingthe third set of executable code; receiving validation of the third setof executable code from a second entity node; receiving validation ofthe third set of executable code from a third entity node; and deployingthe third set of executable code to the distributed ledger.

In some embodiments, the distributed ledger is a channel-dependentchained repository, wherein data records of the distributed ledger areassigned to a first private channel.

In some embodiments, automatically executing the second set ofexecutable code further comprises transferring a second allocation ofthe amount of resources from the first entity to a fourth entity.

In some embodiments, the computer-readable program code portions furthercomprise executable code portions for providing authorized access of thedistributed server to a non-related third-party entity.

In some embodiments, the distributed server hosts a distributed ledger,wherein the first set of executable code and the second set ofexecutable code are deployed to the distributed ledger as smartcontracts.

In some embodiments, the first set of conditions comprises a securityterm.

Embodiments of the present disclosure also provide acomputer-implemented method for performing resource transfers using adistributed server. The method may comprise detecting that a first setof conditions has triggered a first set of executable code;automatically executing the first set of executable code to transmit aresource transfer request to a second entity; detecting a transfer of anamount of resources from the second entity to a first entity; detectingthat a second set of conditions has triggered a second set of executablecode; and automatically executing the second set of executable code totransfer a first allocation of the amount of resources from the firstentity to a third entity.

In some embodiments, the distributed server hosts a distributed ledger.In such embodiments, the method further comprises submitting a requestto add a third set of executable code to the distributed ledger;validating the third set of executable code; receiving validation of thethird set of executable code from a second entity node; receivingvalidation of the third set of executable code from a third entity node;and deploying the third set of executable code to the distributedledger.

In some embodiments, the distributed ledger is a channel-dependentchained repository, wherein data records of the distributed ledger areassigned to a first private channel.

In some embodiments, automatically executing the second set ofexecutable code further comprises transferring a second allocation ofthe amount of resources from the first entity to a fourth entity.

In some embodiments, the method further comprises providing authorizedaccess of the distributed server to a non-related third-party entity.

In some embodiments, the distributed server hosts a distributed ledger,wherein the first set of executable code and the second set ofexecutable code are deployed to the distributed ledger as smartcontracts.

In some embodiments, the first set of conditions comprises a securityterm.

In some embodiments, the second set of conditions comprises receipt ofthe amount of resources by the first entity.

The features, functions, and advantages that have been discussed may beachieved independently in various embodiments of the present inventionor may be combined with yet other embodiments, further details of whichcan be seen with reference to the following description and drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

Having thus described embodiments of the invention in general terms,reference will now be made to the accompanying drawings, wherein:

FIG. 1 illustrates an operating environment for the resource transferdistributed server system, in accordance with one embodiment of thepresent disclosure;

FIG. 2 is a block diagram illustrating the data structures within anexemplary blockchain distributed ledger, in accordance with oneembodiment of the present disclosure;

FIG. 3 illustrates a process flow for deploying executable code in theresource transfer distributed server system, in accordance with oneembodiment of the present disclosure;

FIG. 4 illustrates a process flow for conducting a resource transferusing the resource transfer distributed server system, in accordancewith one embodiment of the present disclosure; and

FIG. 5 is a block diagram illustrating a channel-dependent chainedrepository for use in conducting a resource transfer, in accordance withone embodiment of the present disclosure.

DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION

Embodiments of the present invention will now be described more fullyhereinafter with reference to the accompanying drawings, in which some,but not all, embodiments of the invention are shown. Indeed, theinvention may be embodied in many different forms and should not beconstrued as limited to the embodiments set forth herein; rather, theseembodiments are provided so that this disclosure will satisfy applicablelegal requirements. Like numbers refer to elements throughout. Wherepossible, any terms expressed in the singular form herein are meant toalso include the plural form and vice versa, unless explicitly statedotherwise. Also, as used herein, the term “a” and/or “an” shall mean“one or more,” even though the phrase “one or more” is also used herein.

“Entity” as used herein may refer to an individual or an organizationthat owns and/or operates an online system of networked computingdevices, systems, and/or peripheral devices on which the systemdescribed herein is implemented. The entity may be a businessorganization, a non-profit organization, a government organization, andthe like, which may routinely use various types of applications withinits enterprise environment to accomplish its organizational objectives.

“Entity system” as used herein may refer to the computing systems,devices, software, applications, communications hardware, and/or otherresources used by the entity to perform the functions as describedherein. Accordingly, the entity system may comprise desktop computers,laptop computers, servers, Internet-of-Things (“IoT”) devices, networkedterminals, mobile smartphones, smart devices (e.g., smart watches),network connections, and/or other types of computing systems or devicesand/or peripherals along with their associated applications.

“Computing system” or “computing device” as used herein may refer to anetworked computing device within the entity system. The computingsystem may include a processor, a non-transitory storage medium, acommunications device, and a display. The computing system may beconfigured to support user logins and inputs from any combination ofsimilar or disparate devices. Accordingly, the computing system may be aportable electronic device such as a smartphone, tablet, single boardcomputer, smart device, or laptop. In other embodiments, the computingsystem may be a stationary unit such as a personal desktop computer,networked terminal, IoT device, or the like.

“User” as used herein may refer to an individual who may interact withthe entity system to access the functions therein. Accordingly, the usermay be an agent, employee, associate, contractor, or other authorizedparty who may access, use, administrate, maintain, and/or manage thecomputing systems within the entity system. In other embodiments, theuser may be a client or customer of the entity.

Accordingly, as used herein the term “user device” or “mobile device”may refer to mobile phones, personal computing devices, tabletcomputers, wearable devices, and/or any portable electronic devicecapable of receiving and/or storing data therein.

“Distributed ledger,” or “distributed electronic ledger” as used hereinmay refer to a structured list of data records that is decentralized anddistributed amongst a plurality of computing systems and/or devices. Insome embodiments, the distributed ledger may be a blockchain ledger.

“Blockchain” as used herein may refer to a data structure which maycomprise a series of sequentially linked “blocks,” where each block maycomprise data and metadata. The “data” within each block may compriseone or more “data record” or “transactions,” while the “metadata” withineach block may comprise information about the block, which may include atimestamp, a hash value of data records within the block, and a pointer(e.g., a hash value) to the previous block in the blockchain. In thisway, beginning from an originating block (e.g., a “genesis block”), eachblock in the blockchain is linked to another block via the pointerswithin the block headers. If the data or metadata within a particularblock in the blockchain becomes corrupted or modified, the hash valuesfound in the header of the affected block and/or the downstream blocksmay become mismatched, thus allowing the system to detect that the datahas been corrupted or modified.

A “blockchain ledger” may refer to a distributed ledger which usesblockchain data structures. Generally, a blockchain ledger is an “appendonly” ledger in which the data within each block within the blockchainmay not be modified after the block is added to the blockchain; data mayonly be added in a new block to the end of the blockchain. In this way,the blockchain may provide a practically immutable ledger of datarecords over time.

“Permissioned blockchain” as used herein may refer to a blockchainledger for which an access control mechanism is implemented such thatonly known, authorized users may take certain actions with respect tothe blockchain ledger (e.g., add new data records, participate in theconsensus mechanism, or the like). Accordingly, “unpermissionedblockchain” as used herein may refer to a blockchain ledger without anaccess control mechanism.

“Private blockchain” as used herein may refer to a blockchain ledgeraccessible only to users or devices that meet specific criteria (e.g.,authorized users or devices of a certain entity or other organization).Accordingly, a “public blockchain” is a blockchain ledger accessible byany member or device in the public realm.

“Node” as used herein may refer to a computing system on which thedistributed ledger is hosted. In some embodiments, each node maintains afull copy of the distributed ledger. In this way, even if one or morenodes become unavailable or offline, a full copy of the distributedledger may still be accessed via the remaining nodes in the distributedledger system. That said, in some embodiments, the nodes may host ahybrid blockchain such that certain nodes may store certain segments ofthe blockchain but not others.

“Consensus,” “consensus algorithm,” or “consensus mechanism” as usedherein may refer to the process or processes by which nodes come to anagreement with respect to the contents of the distributed ledger.Changes to the ledger (e.g., addition of data records) may requireconsensus to be reached by the nodes in order to become a part of theauthentic version of the ledger. In this way, the consensus mechanismmay ensure that each node maintains a copy of the distributed ledgerthat is consistent with the copies of the distributed ledger hosted onthe other nodes; if the copy of the distributed ledger hosted on onenode becomes corrupted or compromised, the remaining nodes may use theconsensus algorithm to determine the “true” version of the distributedledger. The nodes may use various different mechanisms or algorithms toobtain consensus, such as proof-of-work (“PoW”), proof-of-stake (“PoS”),practical byzantine fault tolerance (“PBFT”), proof-of-authority(“PoA”), or the like.

“Smart contract” as used herein may refer to executable computer code orlogic that may be executed according to an agreement between partiesupon the occurrence of a condition precedent (e.g., a triggering eventsuch as the receipt of a proposed data record). In some embodiments, thesmart contract may be self-executing code that is stored in thedistributed ledger, where the self-executing code may be executed whenthe condition precedent is detected by the system on which the smartcontract is stored.

“Resource” as used herein may refer to an object under the ownership ofa user which is stored or maintained by the entity on the user's behalf.The resource may be intangible or tangible objects such as data files,documents, funds, and the like. Typically, an account associated withthe user contains records of the resources owned by the user.Accordingly, account data may be stored in an account database withinthe entity's systems.

Embodiments of the present disclosure provide system for automatedresource transfer processing using a distributed server network. Thesystem may comprise a distributed ledger network in which plurality ofnodes host a distributed ledger which may comprise a list of datarecords regarding certain actions or processes executed within thesystem. In particular, the data records may relate to resource transfersinvolving multiple distinct entities. In such embodiments, each of themultiple entities may host at least one node of the distributed ledger.In this regard, the distributed ledger may be a private distributedledger which is accessible only to selected entities (e.g., the entitiesinvolved in the resource transfer, certain authorized third parties, orthe like). The distributed ledger may further comprise executable code(e.g., smart contracts) which may automatically execute certainprocesses upon the triggering of certain conditions or events. Throughtheir respective nodes, each entity may be able to read/audit datarecords and/or the executable code within the distributed ledger as wellas submit proposed data records and/or executable code to be added tothe distributed ledger. Accordingly, each node may participate in thevalidation and/or approval of proposed data records and/or executablecode (e.g., via a consensus mechanism).

An exemplary embodiment is provided below for illustrative purposes. Inone embodiment, the distributed ledger may store data records regardingresource transfers (e.g., transactions such as security trustee paymentprocesses), where the distributed ledger is hosted on nodes owned and/oroperated by the related entities to the resource transfers (e.g., anissuer, a trustee, an investor, and/or the like). Each of the relatedentities may participate in the validation and/or approval of thedeployment of smart contracts related to the resource transfer process.In some embodiments, the smart contract approval process may occur in aloop such that a first entity generates a smart contract and transmitsthe smart contract to a second entity. The second entity may audit thesmart contract based on the underlying logic of the executable code andeither approve or reject the smart contract. If rejected, the smartcontract may be transmitted to the remainder of the related entities insequence until the last entity gives a final approval for the smartcontract to be deployed to the distributed ledger. In this way, thesystem may provide a transparent process for generating and validatingsmart contracts for multiple different entities.

Once at least on smart contract has been deployed to the distributedledger as described above, one of the entities may begin the resourcetransfer process by triggering one of the smart contracts associatedwith the resource transfer. For example, a trustee may begin a securitytrustee payment process by triggering a smart contract which may causean invoice to be transmitted to an issuer. Once the issuer submitspayment to the trustee and the trustee receives the funds, the trusteemay trigger a second smart contract to begin the fund distributionprocess (e.g., transfer funds to an investor). Each step of the resourcetransfer process may be submitted by the various nodes for addition tothe distributed ledger. In this regard, each node may submit proposeddata records to be appended to the distributed ledger, where theproposed data records may contain information regarding the steps thathave been executed within the resource transfer process. For example,the issuer may submit a proposed data record indicating that payment hasbeen sent to the trustee. Once said proposed data record is appended tothe distributed ledger, all of the related parties to the resourcetransfer may become aware of the current state (e.g., the steps thathave been completed and that have yet to be completed) of the resourcetransfer process. Furthermore, authorized access may be granted tospecified third parties (e.g., regulatory agencies) for auditingpurposes.

The system as described herein confers a number of technologicaladvantages over conventional methods of processing resource transfers.In particular, storing the distributed ledger across all of the nodeswithin the distributed ledger network allows for automatic real-time ornear real-time synchronization of data records while providingadditional layers of security against data tampering or corruption.Furthermore, the private distributed ledger provides transparency andefficiency gains by drastically reducing the resource transferprocessing time.

Turning now to the figures, FIG. 1 illustrates an operating environment100 for the resource transfer distributed server system, in accordancewith one embodiment of the present disclosure. In particular, FIG. 1illustrates a first entity node 101 that is communicatively coupled witha second entity node 102 and a third entity node 103. The first entitynode 101, second entity node 102, and third entity node 103 may be partof a distributed ledger network 107 in which each node maintains a copyof a distributed ledger as described herein. It should be understoodthat FIG. 1 illustrates only an exemplary embodiment of the operatingenvironment 100, and it will be appreciated that one or more functionsof the systems, devices, or servers as depicted in FIG. 1 may becombined into a single system, device, or server. For instance, althoughFIG. 1 depicts the first entity node 101 and the second entity node 102as separate computing systems, the functions of each may be executed ona single computing system. Furthermore, a single system, device, orserver as depicted in FIG. 1 may represent multiple systems, devices, orservers. For instance, though FIG. 1 depicts a single third entity node103, each entity may host more than one node. Furthermore, in someembodiments, the operating environment 100 may comprise nodes operatedby additional entities (e.g., a fourth entity node, fifth entity node,and the like).

The network may be a system specific distributive network receiving anddistributing specific network feeds and identifying specific networkassociated triggers. The network include one or more cellular radiotowers, antennae, cell sites, base stations, telephone networks, cloudnetworks, radio access networks (RAN), WiFi networks, or the like.Additionally, the network may also include a global area network (GAN),such as the Internet, a wide area network (WAN), a local area network(LAN), or any other type of network or combination of networks.Accordingly, the network may provide for wireline, wireless, or acombination wireline and wireless communication between devices on thenetwork.

As illustrated in FIG. 1 , the first entity node 101 may be a computingsystem that is owned and/or operated by a first entity. Accordingly, thefirst entity node 101 may be, for example, a networked terminal, server,desktop computer, or the like, though it is within the scope of thedisclosure for the first entity node 101 to be a portable device such asa cellular phone, smart phone, smart device, personal data assistant(PDA), laptop, or the like. The first entity node 101 may comprise acommunication device 112, a processing device 114, and a memory device116, where the processing device 114 is operatively coupled to thecommunication device 112 and the memory device 116. The processingdevice 114 uses the communication device 112 to communicate with thenetwork and other devices on the network. As such, the communicationdevice 112 generally comprises a modem, antennae, WiFi or Ethernetadapter, radio transceiver, or other device for communicating with otherdevices on the network.

The memory device 116 comprises computer-readable instructions 120 anddata storage 118, where the data storage 118 may comprise a copy of adistributed ledger 122. The distributed ledger (and the copy of thedistributed ledger 122) may comprise a series of data records relevantto the objectives of the entity. For instance, the distributed ledgermay comprise a series of data records comprising various types ofinformation, such as resource transfer data, document data, or the like.The distributed ledger may further comprise executable code (e.g., smartcontract logic) embedded within the distributed ledger. The smartcontract logic may be executed by the various nodes and/or othercomputing systems within the network environment to automaticallyexecute certain processes upon the occurrence of a preset condition.

As further illustrated in FIG. 1 , the second entity node 102 may be acomputing system that is owned and/or operated by a second entity. Thesecond entity node 102 may comprise a communication device 132,processing device 154, and a memory device 136. The memory device 136may comprise a data storage 138 and computer readable instructions 140,where the data storage 138 comprises a copy of the distributed ledger122.

As further illustrated in FIG. 1 , the third entity node 103 be acomputing system that is owned and/or operated by a third entity.Accordingly, the third entity node 103 may comprise a communicationdevice 152, a processing device 154, and a memory device 156. As usedherein, the term “processing device” generally includes circuitry usedfor implementing the communication and/or logic functions of theparticular system. For example, a processing device may include adigital signal processor device, a microprocessor device, and variousanalog-to-digital converters, digital-to-analog converters, and othersupport circuits and/or combinations of the foregoing. Control andsignal processing functions of the system are allocated between theseprocessing devices according to their respective capabilities. Theprocessing device may include functionality to operate one or moresoftware programs based on computer-readable instructions thereof, whichmay be stored in a memory device.

The communication device 152, and other communication devices asdescribed herein, may comprise a wireless local area network (WLAN) suchas WiFi based on the Institute of Electrical and Electronics Engineers'(IEEE) 802.11 standards, Bluetooth short-wavelength UHF radio waves inthe ISM band from 2.4 to 2.485 GHz or other wireless access technology.Alternatively or in addition to the wireless interface, communicationdevices may also include a communication interface device that may beconnected by a hardwire connection to the resource distribution device.The interface device may comprise a connector such as a USB, SATA, PATA,SAS or other data connector for transmitting data to and from therespective computing system.

The processing device 154 is operatively coupled to the communicationdevice 152 and the memory device 156. The processing device 154 uses thecommunication device 152 to communicate with the network and otherdevices on the network, such as, but not limited to the first entitynode 101. The communication device 152 generally comprises a modem,antennae, WiFi or Ethernet adapter, radio transceiver, or other devicefor communicating with other devices on the network. The memory device156 may further include data storage 158 which may comprise a copy ofthe distributed ledger 122, along with computer readable instructions160. The data within the copies of the distributed ledger 122 stored onthe nodes 101, 102, 103 may be identical to one another. In this regard,the contents of the distributed ledger (and the copies of thedistributed ledger 122) may be kept consistent with one another via aconsensus algorithm, as described elsewhere herein.

The computing systems described herein may each further include aprocessing device communicably coupled to devices as a memory device,output devices, input devices, a network interface, a power source, aclock or other timer, a camera, a positioning system device, agyroscopic device, one or more chips, and the like.

In some embodiments, the computing systems may access one or moredatabases or datastores (not shown) to search for and/or retrieveinformation related to the service provided by the entity. The computingsystems may also access a memory and/or datastore local to the variouscomputing systems within the operating environment 100.

The processing devices as described herein may include functionality tooperate one or more software programs or applications, which may bestored in the memory device. For example, a processing device may becapable of operating a connectivity program, such as a web browserapplication. In this way, the computing systems may transmit and receiveweb content, such as, for example, product valuation, serviceagreements, location-based content, and/or other web page content,according to a Wireless Application Protocol (WAP), Hypertext TransferProtocol (HTTP), and/or the like.

A processing device may also be capable of operating applications. Theapplications may be downloaded from a server and stored in the memorydevice of the computing systems. Alternatively, the applications may bepre-installed and stored in a memory in a chip.

The chip may include the necessary circuitry to provide integrationwithin the devices depicted herein. Generally, the chip will includedata storage which may include data associated with the service that thecomputing systems may be communicably associated therewith. The chipand/or data storage may be an integrated circuit, a microprocessor, asystem-on-a-chip, a microcontroller, or the like. In this way, the chipmay include data storage. Of note, it will be apparent to those skilledin the art that the chip functionality may be incorporated within otherelements in the devices. For instance, the functionality of the chip maybe incorporated within the memory device and/or the processing device.In a particular embodiment, the functionality of the chip isincorporated in an element within the devices. Still further, the chipfunctionality may be included in a removable storage device such as anSD card or the like.

A processing device may be configured to use the network interface tocommunicate with one or more other devices on a network. In this regard,the network interface may include an antenna operatively coupled to atransmitter and a receiver (together a “transceiver”). The processingdevice may be configured to provide signals to and receive signals fromthe transmitter and receiver, respectively. The signals may includesignaling information in accordance with the air interface standard ofthe applicable cellular system of the wireless telephone network thatmay be part of the network. In this regard, the computing systems may beconfigured to operate with one or more air interface standards,communication protocols, modulation types, and access types. By way ofillustration, the devices may be configured to operate in accordancewith any of a number of first, second, third, fourth, and/orfifth-generation communication protocols and/or the like. For example,the computing systems may be configured to operate in accordance withsecond-generation (2G) wireless communication protocols IS-136 (timedivision multiple access (TDMA)), GSM (global system for mobilecommunication), and/or IS-95 (code division multiple access (CDMA)), orwith third-generation (3G) wireless communication protocols, such asUniversal Mobile Telecommunications System (UMTS), CDMA2000, widebandCDMA (WCDMA) and/or time division-synchronous CDMA (TD-SCDMA), withfourth-generation (4G) wireless communication protocols, withfifth-generation (5G) wireless communication protocols, or the like. Thedevices may also be configured to operate in accordance withnon-cellular communication mechanisms, such as via a wireless local areanetwork (WLAN) or other communication/data networks.

The network interface may also include an application interface in orderto allow a user or service provider to execute some or all of theabove-described processes. The application interface may have access tothe hardware, e.g., the transceiver, and software previously describedwith respect to the network interface. Furthermore, the applicationinterface may have the ability to connect to and communicate with anexternal data storage on a separate system within the network.

The devices may have an interface that includes user output devicesand/or input devices. The output devices may include a display (e.g., aliquid crystal display (LCD) or the like) and a speaker or other audiodevice, which are operatively coupled to the processing device. Theinput devices, which may allow the devices to receive data from a user,may include any of a number of devices allowing the devices to receivedata from a user, such as a keypad, keyboard, touch-screen, touchpad,microphone, mouse, joystick, other pointer device, button, soft key,and/or other input device(s).

The devices may further include a power source. Generally, the powersource is a device that supplies electrical energy to an electricalload. In some embodiment, power source may convert a form of energy suchas solar energy, chemical energy, mechanical energy, or the like toelectrical energy. Generally, the power source may be a battery, such asa lithium battery, a nickel-metal hydride battery, or the like, that isused for powering various circuits, e.g., the transceiver circuit, andother devices that are used to operate the devices. Alternatively, thepower source may be a power adapter that can connect a power supply froma power outlet to the devices. In such embodiments, a power adapter maybe classified as a power source “in” the devices.

As described above, the computing devices as shown in FIG. 1 may alsoinclude a memory device operatively coupled to the processing device. Asused herein, “memory” may include any computer readable mediumconfigured to store data, code, or other information. The memory devicemay include volatile memory, such as volatile Random Access Memory (RAM)including a cache area for the temporary storage of data. The memorydevice may also include non-volatile memory, which can be embeddedand/or may be removable. The non-volatile memory may additionally oralternatively include an electrically erasable programmable read-onlymemory (EEPROM), flash memory or the like.

The memory device may store any of a number of applications or programswhich comprise computer-executable instructions/code executed by theprocessing device to implement the functions of the devices describedherein.

The computing systems may further comprise a gyroscopic device. Thepositioning system, input device, and the gyroscopic device may be usedin correlation to identify phases within a service term.

Each computing system may also have a control system for controlling thephysical operation of the device. The control system may comprise one ormore sensors for detecting operating conditions of the variousmechanical and electrical systems that comprise the computing systems orof the environment in which the computing systems are used. The sensorsmay communicate with the processing device to provide feedback to theoperating systems of the device. The control system may also comprisemetering devices for measuring performance characteristics of thecomputing systems. The control system may also comprise controllers suchas programmable logic controllers (PLC), proportional integralderivative controllers (PID) or other machine controllers. The computingsystems may also comprise various electrical, mechanical, hydraulic orother systems that perform various functions of the computing systems.These systems may comprise, for example, electrical circuits, motors,compressors, or any system that enables functioning of the computingsystems.

FIG. 2 is a block diagram illustrating the data structures within anexemplary blockchain distributed ledger, in accordance with someembodiments. In particular, FIG. 2 depicts a plurality of blocks 200,201 within the blockchain ledger 122, in addition to a pending block 202that has been submitted to be appended to the blockchain ledger 122. Theblockchain ledger 122 may comprise a genesis block 200 that serves asthe first block and origin for subsequent blocks in the blockchainledger 122. The genesis block 200, like all other blocks within theblockchain ledger 122, comprise a block header 201 and block data 209.The genesis block data 209, or any other instances of block data withinthe blockchain ledger 122 (or any other distributed ledger) may containone or more data records. For instance, block data may comprise softwaresource code, authentication data, transaction data, documents or otherdata containers, third party information, regulatory and/or legal data,or the like.

The genesis block header 201 may comprise various types of metadataregarding the genesis block data 209. In some embodiments, the blockheader 201 may comprise a genesis block root hash 203, which is a hashderived from an algorithm using the genesis block data 209 as inputs. Insome embodiments, the genesis block root hash 203 may be a Merkle roothash, wherein the genesis block root hash 203 is calculated via a hashalgorithm based on a combination of the hashes of each data recordwithin the genesis block data 209. In this way, any changes to the datawithin the genesis block data 209 will result in a change in the genesisblock root hash 203. The genesis block header 201 may further comprise agenesis block timestamp 204 that indicates the time at which the blockwas written to the blockchain ledger 122. In some embodiments, thetimestamp may be a Unix timestamp. In some embodiments, particularly inblockchains utilizing a PoW consensus mechanism, the block header 201may comprise a nonce value and a difficulty value. The nonce value maybe a whole number value that, when combined with the other items ofmetadata within the block header 201 into a hash algorithm, produces ahash output that satisfies the difficulty level of the cryptographicpuzzle as defined by the difficulty value. For instance, the consensusmechanism may require that the resulting hash of the block header 201falls below a certain value threshold (e.g., the hash value must startwith a certain number of zeroes, as defined by the difficulty value).

A subsequent block 201 may be appended to the genesis block 200 to serveas the next block in the blockchain. Like all other blocks, thesubsequent block 201 comprises a block header 211 and block data 219.Similarly, the block header 211 comprise a block root hash 213 of thedata within the block data 219 and a block timestamp 214. The blockheader 211 may further comprise a previous block pointer 212, which maybe a hash calculated by combining the hashes of the metadata (e.g., thegenesis block root hash 203, genesis block timestamp 204, and the like)within the block header 201 of the genesis block 200. In this way, theblock pointer 212 may be used to identify the previous block (i.e., thegenesis block 200) in the blockchain ledger 122, thereby creating a“chain” comprising the genesis block 200 and the subsequent block 201.

The value of a previous block pointer is dependent on the hashes of theblock headers of all of the previous blocks in the chain; if the blockdata within any of the blocks is altered, the block header for thealtered block as well as all subsequent blocks will result in differenthash values. In other words, the hash in the block header may not matchthe hash of the values within the block data, which may cause subsequentvalidation checks to fail. Even if an unauthorized user were to changethe block header hash to reflect the altered block data, this would inturn change the hash values of the previous block pointers of the nextblock in the sequence. Therefore, an unauthorized user who wishes toalter a data record within a particular block must also alter the hashesof all of the subsequent blocks in the chain in order for the alteredcopy of the blockchain to pass the validation checks imposed by theconsensus algorithm. Thus, the computational impracticability ofaltering data records in a blockchain in turn greatly reduces the chanceof improper alteration of data records.

A pending block 202 or “proposed block” may be submitted for addition tothe blockchain ledger 122. The pending block 202 may comprise a pendingblock header 221, which may comprise a pending block root hash 223, aprevious block pointer 222 that points to the previous block 201, apending block timestamp 224, and pending block data 229. Once a pendingblock 202 is submitted to the system, the nodes within the system mayvalidate the pending block 202 via a consensus algorithm. The consensusalgorithm may be, for instance, a proof of work mechanism, in which anode determines a nonce value that, when combined with a hash of theblock header 211 of the last block in the blockchain, produces a hashvalue that falls under a specified threshold value. For instance, thePoW algorithm may require that said hash value begins with a certainnumber of zeroes. Once said nonce value is determined by one of thenodes in the blockchain, the node may post the “solution” to the othernodes in the blockchain. Once the solution is validated by the othernodes, the hash of the block header 211 is included in the pending blockheader 221 of the pending block 202 as the previous block pointer 222.The pending block header 221 may further comprise the pending block roothash 223 of the pending block data 229 which may be calculated based onthe winning solution. The pending block 202 is subsequently consideredto be appended to the previous block 201 and becomes a part of theblockchain ledger 122. A pending block timestamp 224 may also be addedto signify the time at which the pending block 202 is added to theblockchain ledger 122.

In other embodiments, the consensus mechanism may be based on a totalnumber of consensus inputs submitted by the nodes of the blockchainledger 122, e.g., a PBFT consensus mechanism. Once a threshold number ofconsensus inputs to validate the pending block 202 has been reached, thepending block 202 may be appended to the blockchain ledger 122. In suchembodiments, nonce values and difficulty values may be absent from theblock headers. In still other embodiments, the consensus algorithm maybe a Proof-of-Stake mechanism in which the stake (e.g., amount ofdigital currency, reputation value, or the like) may influence thedegree to which the node may participate in consensus and select thenext proposed block. In other embodiments, the consensus algorithm maybe a Proof-of-Authority mechanism in which the identity of the validatoritself (with an attached reputation value) may be used to validateproposed data records (e.g., the ability to participate inconsensus/approval of proposed data records may be limited to approvedand/or authorized validator nodes). In yet other embodiments, theconsensus algorithm may comprise a manual node approval process ratherthan an automated process.

FIG. 3 illustrates a process flow 300 for deploying executable code in aresource transfer distributed server system, in accordance with oneembodiment of the present disclosure. The process begins at block 301,where the system detects that a first entity has submitted a request toadd executable code to a distributed ledger. The logic of the executablecode may be written or determined by the first entity, which may be theentity that coordinates the resource transfer process. In an exemplaryembodiment, the first entity may be a trustee that uses the system toconduct a security trustee payment process. In such an embodiment, thetrustee may submit a proposed smart contract to the nodes within thesystem for deployment to the distributed ledger. The smart contract maybe configured to execute certain processes automatically upon beingtriggered. For instance, the smart contract may cause the system,according to the security term, to trigger an invoice to be generatedand/or sent to a second entity, which may be an issuer of the securityassociated with the resource transfer process.

The process continues to block 302, where the system detects that thefirst entity has validated the executable code. Each node mayparticipate in the validation and/or approval of the proposed smartcontract before deployment. Accordingly, the submitter of the proposedsmart contract (e.g., the first entity) may also be a part of the smartcontract approval process.

The process continues to block 303, where the system detects that thesecond entity has validated the executable code. The second entity(e.g., an issuer) may use the system to read the smart contract logicand review the logic for accuracy. Subsequently, the second entity nodemay validate and approve the smart contract.

The process continues to block 304, where the system detects that athird entity has validated the executable code. The third entity may be,for instance, an investor in the security associated with the resourcetransfer process. Accordingly, the third entity may also read the smartcontract logic and review for accuracy. The third entity node may thenvalidate and approve the smart contract.

The process concludes at block 305, where the system deploys theexecutable code to the distributed ledger. The system may require thatall of the related entities to the resource transfer process approve thesmart contract before deploying the smart contract. Once each relatedentity has validated and approved the smart contract, the smart contractmay be embedded in the distributed ledger. Subsequently, the detectionof the triggering events or conditions by the system may automaticallycause the smart contract to execute its processes as determined by thesmart contract logic. In this way, the system described herein mayincrease the transparency and reliability of the resource transferprocess.

FIG. 4 illustrates a process flow 400 for conducting a resource transferusing the resource transfer distributed server system. The processbegins at block 401, where the system detects that a first set ofconditions has triggered a first set of executable code. Continuing theabove example, the first set of executable code may be a first smartcontract that causes an invoice to be automatically generated andtransmitted to the second entity (e.g., the issuer). The first smartcontract may be triggered, for instance, according to the term of thesecurity associated with the resource transfer process (e.g., adistribution payment becomes due). Details regarding the security termmay in turn be stored within the distributed ledger as a data recordsuch that the existence of the data record triggers execution of thefirst smart contract. When the first smart contract is triggered, thesystem may write a data record associated with the triggering of thefirst smart contract to the distributed ledger.

The process continues to block 402, where the system automaticallyexecutes the first set of executable code to transmit a resourcetransfer request to a second entity. The resource transfer request maybe the invoice sent to the issuer upon the triggering of the first smartcontract, where the invoice may be a request to transfer the resource(e.g., distribution funds associated with the security) to a certainentity (e.g., the trustee).

The process continues to block 403, where the system detects a transferof an amount of resources from the second entity to the first entity. Inresponse to the request, the issuer may transmit the distribution fundsto the trustee (e.g., to an account of the trustee). The confirmation ofthe fund transmittal may further be recorded as a data record within thedistributed ledger such that the existence of said data record may, atleast in part, trigger the execution of other smart contracts.Furthermore, a subsequent data record confirming receipt of the funds bythe trustee may also be appended to the distributed ledger.

The process continues to block 404, where the system detects that asecond set of conditions has triggered a second set of executable code.Execution of the second set of executable code (e.g., a second smartcontract) may be triggered upon the system detecting the existence of adata record indicating receipt of the distribution funds by the trustee.The second smart contract, once triggered, may automatically cause thedistribution funds to be transferred from the trustee to a third entity(e.g., an investor).

The process concludes at block 405, where the system automaticallyexecutes the second set of executable code to transfer at least aportion of the amount of resources from the first entity to a thirdentity. As described above, the resources may be the funds to bedistributed as part of the resource transfer process. Accordingly, inthe event that multiple investors have an interest in the distributionfunds, each investor may receive an allocation (e.g., at least aportion) of the distribution funds as part of the process as determinedby the second smart contract. For instance, in embodiments in whichthere are two investors (e.g., a third entity and a fourth entity), thesecond smart contract may cause a first allocation of the funds to besent to the third entity and a second allocation of the funds (e.g., theremainder) to be sent to the fourth entity.

In some embodiments, the system may grant authorized access to thedistributed ledger to certain entities that are not directly related tothe resource transfer process. For instance, the system may grant accessto certain data records related to the resource transfer to anon-related third party entity for auditing purposes (e.g., a regulatoryagency, insurance provider, or the like). In this way, the system mayprovide an efficient and open way to process resource transfers.

FIG. 5 is a block diagram illustrating a channel-dependent chainedrepository for use in conducting a resource transfer, in accordance withone embodiment of the present disclosure. In some embodiments, certainentities may wish to establish a secure and private channel throughwhich the entities may conduct their resource transfers. In this regard,the system may generate a private channel for each specific set ofentities along with separate blockchain ledgers assigned to eachchannel. For instance, a first channel may be established for entitiesA, B, and C, and a second channel may be established for entities D, E,and F. In such a configuration, the channels may be securely separated(e.g., using cryptographic keys and hashes) from one another such thatthe entities assigned to the first channel may not access the datarecords within the second channel, and vice versa.

Accordingly, FIG. 5 depicts a chained repository 510 (e.g., a blockchainledger) comprising a genesis block 501, second block 502, third block503, fourth block 504, fifth block 505, and a sixth block 506, where thechained repository 510 is assigned to a first channel 500. The datarecords within the chained repository 510 may be generated according toembedded executable code 520 within the chained repository (e.g., one ormore smart contracts). The executable code 520 may, through a series ofoperations, add blocks to the blockchain ledger within the first channel500 such that the blocks are inaccessible to entities who are notparties to the first channel 500.

In an exemplary embodiment, the system may generate a block for eachcompleted step within a resource transfer process (e.g., a securitytrustee payment process). The executable code 520 may, through a firstoperation 511 (e.g., creation of account data for the entities involved,entity-specific information, security information, or the like),generate the genesis block 501 of the chained repository 510. Theexecutable code 520 may then, through a second operation 512 (e.g.,triggering of an security term), generate the second block 502. A thirdoperation 513 (e.g., transmission of an invoice to an issuer) may causethe third block 503 to be generated. A fourth operation 514 (e.g.,confirmation of receipt of payment) may cause the fourth block 504 to begenerated. A fifth operation 515 (e.g., calculation allocation ofdistributions) may cause the fifth block 505 to be generated. Finally, asixth operation 516 (e.g., transfer of distributions to one or moreinvestors) may cause the sixth block 506 to be generated. In this way,the blocks 501, 502, 503, 504, 505, 506 may contain a complete historyof actions taken within the resource transfer process within the firstchannel 500. Other resource transfer processes initiated by differentsets of entities and related parties may be executed through a secondchannel with a separate chained repository, as described above.Accordingly, even if multiple entities share the same hardwaresystem/platform, the channel-specific chained repositories allow asecure and private way to conduct resource transfers among specificgroups of entities.

As will be appreciated by one of ordinary skill in the art, the presentinvention may be embodied as an apparatus (including, for example, asystem, a machine, a device, a computer program product, and/or thelike), as a method (including, for example, a business process, acomputer-implemented process, and/or the like), or as any combination ofthe foregoing. Accordingly, embodiments of the present invention maytake the form of an entirely software embodiment (including firmware,resident software, micro-code, and the like), an entirely hardwareembodiment, or an embodiment combining software and hardware aspectsthat may generally be referred to herein as a “system.” Furthermore,embodiments of the present invention may take the form of a computerprogram product that includes a computer-readable storage medium havingcomputer-executable program code portions stored therein.

As the phrase is used herein, a processor may be “configured to” performa certain function in a variety of ways, including, for example, byhaving one or more general-purpose circuits perform the function byexecuting particular computer-executable program code embodied incomputer-readable medium, and/or by having one or moreapplication-specific circuits perform the function.

It will be understood that any suitable computer-readable medium may beutilized. The computer-readable medium may include, but is not limitedto, a non-transitory computer-readable medium, such as a tangibleelectronic, magnetic, optical, infrared, electromagnetic, and/orsemiconductor system, apparatus, and/or device. For example, in someembodiments, the non-transitory computer-readable medium includes atangible medium such as a portable computer diskette, a hard disk, arandom access memory (RAM), a read-only memory (ROM), an erasableprogrammable read-only memory (EEPROM or Flash memory), a compact discread-only memory (CD-ROM), and/or some other tangible optical and/ormagnetic storage device. In other embodiments of the present invention,however, the computer-readable medium may be transitory, such as apropagation signal including computer-executable program code portionsembodied therein.

It will also be understood that one or more computer-executable programcode portions for carrying out the specialized operations of the presentinvention may be required on the specialized computer includeobject-oriented, scripted, and/or unscripted programming languages, suchas, for example, Java, Perl, Smalltalk, C++, SAS, SQL, Python, ObjectiveC, and/or the like. In some embodiments, the one or morecomputer-executable program code portions for carrying out operations ofembodiments of the present invention are written in conventionalprocedural programming languages, such as the “C” programming languagesand/or similar programming languages. The computer program code mayalternatively or additionally be written in one or more multi-paradigmprogramming languages, such as, for example, F #.

Embodiments of the present invention are described above with referenceto flowcharts and/or block diagrams. It will be understood that steps ofthe processes described herein may be performed in orders different thanthose illustrated in the flowcharts. In other words, the processesrepresented by the blocks of a flowchart may, in some embodiments, be inperformed in an order other that the order illustrated, may be combinedor divided, or may be performed simultaneously. It will also beunderstood that the blocks of the block diagrams illustrated, in someembodiments, merely conceptual delineations between systems and one ormore of the systems illustrated by a block in the block diagrams may becombined or share hardware and/or software with another one or more ofthe systems illustrated by a block in the block diagrams. Likewise, adevice, system, apparatus, and/or the like may be made up of one or moredevices, systems, apparatuses, and/or the like. For example, where aprocessor is illustrated or described herein, the processor may be madeup of a plurality of microprocessors or other processing devices whichmay or may not be coupled to one another. Likewise, where a memory isillustrated or described herein, the memory may be made up of aplurality of memory devices which may or may not be coupled to oneanother.

It will also be understood that the one or more computer-executableprogram code portions may be stored in a transitory or non-transitorycomputer-readable medium (e.g., a memory, and the like) that can directa computer and/or other programmable data processing apparatus tofunction in a particular manner, such that the computer-executableprogram code portions stored in the computer-readable medium produce anarticle of manufacture, including instruction mechanisms which implementthe steps and/or functions specified in the flowchart(s) and/or blockdiagram block(s).

The one or more computer-executable program code portions may also beloaded onto a computer and/or other programmable data processingapparatus to cause a series of operational steps to be performed on thecomputer and/or other programmable apparatus. In some embodiments, thisproduces a computer-implemented process such that the one or morecomputer-executable program code portions which execute on the computerand/or other programmable apparatus provide operational steps toimplement the steps specified in the flowchart(s) and/or the functionsspecified in the block diagram block(s). Alternatively,computer-implemented steps may be combined with operator and/orhuman-implemented steps in order to carry out an embodiment of thepresent invention.

While certain exemplary embodiments have been described and shown in theaccompanying drawings, it is to be understood that such embodiments aremerely illustrative of, and not restrictive on, the broad invention, andthat this invention not be limited to the specific constructions andarrangements shown and described, since various other changes,combinations, omissions, modifications and substitutions, in addition tothose set forth in the above paragraphs, are possible. Those skilled inthe art will appreciate that various adaptations and modifications ofthe just described embodiments can be configured without departing fromthe scope and spirit of the invention. Therefore, it is to be understoodthat, within the scope of the appended claims, the invention may bepracticed other than as specifically described herein.

What is claimed is:
 1. A system for performing resource transfers usinga distributed server, the system comprising: a memory device withcomputer-readable program code stored thereon; a communication device;and a processing device operatively coupled to the memory device and thecommunication device, wherein the processing device is configured toexecute the computer-readable program code to: detect that a first setof conditions has triggered a first set of executable code, whereindetecting that the first set of conditions has triggered the first setof executable code comprises reading a security term associated with asecurity from a first data record within a distributed ledger hosted onthe distributed server, wherein the security term indicates that adistribution payment associated with the security has become due;automatically execute the first set of executable code to transmit aresource transfer request to a second entity based on detecting thefirst data record within the distributed ledger; detect, from a seconddata record within the distributed ledger, a transfer of an amount ofresources from the second entity to a first entity, wherein the amountof resources from the second entity to the first entity comprises thedistribution payment associated with the security, wherein the seconddata record indicates a transmittal of the amount of resources from thesecond entity to the first entity; detect, from a third data recordwithin the distributed ledger, that a second set of conditions hastriggered a second set of executable code, wherein the third data recordindicates a receipt of the amount of resources by the first entity;based on detecting the third data record, automatically execute thesecond set of executable code to transfer a first allocation of theamount of resources from the first entity to a third entity; submit arequest to add a third set of executable code to the distributed ledger;validate the third set of executable code, wherein validating the thirdset of executable comprises approving the third set of executable code;receive validation of the third set of executable code from a secondentity node, wherein validation of the third set of executable code fromthe second entity node comprises an approval of the third set ofexecutable code by the second entity; receive validation of the thirdset of executable code from a third entity node, wherein validation ofthe third set of executable code from the third entity node comprises anapproval of the third set of executable code by the third entity; anddeploy the third set of executable code to the distributed ledger basedon: 1) validating the third set of executable code, 2) receivingvalidation of the third set of executable code from the second entitynode, and 3) receiving validation of the third set of executable codefrom the third entity node.
 2. The system according to claim 1, whereinthe distributed ledger is a channel-dependent chained repository,wherein data records of the distributed ledger are assigned to a firstprivate channel.
 3. The system according to claim 1, whereinautomatically executing the second set of executable code furthercomprises transferring a second allocation of the amount of resourcesfrom the first entity to a fourth entity.
 4. The system according toclaim 1, wherein the computer-readable program code further causes theprocessing device to provide authorized access of the distributed serverto a non-related third-party entity.
 5. The system according to claim 1,wherein the distributed server hosts a distributed ledger, wherein thefirst set of executable code and the second set of executable code aredeployed to the distributed ledger as smart contracts.
 6. The systemaccording to claim 1, wherein the second set of conditions comprisesreceipt of the amount of resources by the first entity.
 7. A computerprogram product for performing resource transfers using a distributedserver, the computer program product comprising at least onenon-transitory computer readable medium having computer-readable programcode portions embodied therein, the computer-readable program codeportions comprising executable code portions for: detecting that a firstset of conditions has triggered a first set of executable code, whereindetecting that the first set of conditions has triggered the first setof executable code comprises reading a security term associated with asecurity from a first data record within a distributed ledger hosted onthe distributed server, wherein the security term indicates that adistribution payment associated with the security has become due;automatically executing the first set of executable code to transmit aresource transfer request to a second entity based on detecting thefirst data record within the distributed ledger; detecting, from asecond data record within the distributed ledger, a transfer of anamount of resources from the second entity to a first entity, whereinthe amount of resources from the second entity to the first entitycomprises the distribution payment associated with the security, whereinthe second data record indicates a transmittal of the amount ofresources from the second entity to the first entity; detecting, from athird data record within the distributed ledger, that a second set ofconditions has triggered a second set of executable code, wherein thethird data record indicates a receipt of the amount of resources by thefirst entity; based on detecting the third data record, automaticallyexecuting the second set of executable code to transfer a firstallocation of the amount of resources from the first entity to a thirdentity; submitting a request to add a third set of executable code tothe distributed ledger; validating the third set of executable code,wherein validating the third set of executable comprises approving thethird set of executable code; receiving validation of the third set ofexecutable code from a second entity node, wherein validation of thethird set of executable code from the second entity node comprises anapproval of the third set of executable code by the second entity;receiving validation of the third set of executable code from a thirdentity node, wherein validation of the third set of executable code fromthe third entity node comprises an approval of the third set ofexecutable code by the third entity; and deploying the third set ofexecutable code to the distributed ledger based on: 1) validating thethird set of executable code, 2) receiving validation of the third setof executable code from the second entity node, and 3) receivingvalidation of the third set of executable code from the third entitynode.
 8. The computer program product according to claim 7, wherein thedistributed ledger is a channel-dependent chained repository, whereindata records of the distributed ledger are assigned to a first privatechannel.
 9. The computer program product according to claim 7, whereinautomatically executing the second set of executable code furthercomprises transferring a second allocation of the amount of resourcesfrom the first entity to a fourth entity.
 10. The computer programproduct according to claim 7, wherein the computer-readable program codeportions further comprise executable code portions for providingauthorized access of the distributed server to a non-related third-partyentity.
 11. A computer-implemented method for performing resourcetransfers using a distributed server, the method comprising: detectingthat a first set of conditions has triggered a first set of executablecode, wherein detecting that the first set of conditions has triggeredthe first set of executable code comprises reading a security termassociated with a security from a first data record within a distributedledger hosted on the distributed server, wherein the security termindicates that a distribution payment associated with the security hasbecome due; automatically executing the first set of executable code totransmit a resource transfer request to a second entity based ondetecting the first data record within the distributed ledger;detecting, from a second data record within the distributed ledger, atransfer of an amount of resources from the second entity to a firstentity, wherein the amount of resources from the second entity to thefirst entity comprises the distribution payment associated with thesecurity, wherein the second data record indicates a transmittal of theamount of resources from the second entity to the first entity;detecting, from a third data record within the distributed ledger, thata second set of conditions has triggered a second set of executablecode, wherein the third data record indicates a receipt of the amount ofresources by the first entity; based on detecting the third data record,automatically executing the second set of executable code to transfer afirst allocation of the amount of resources from the first entity to athird entity; submitting a request to add a third set of executable codeto the distributed ledger; validating the third set of executable code,wherein validating the third set of executable comprises approving thethird set of executable code; receiving validation of the third set ofexecutable code from a second entity node, wherein validation of thethird set of executable code from the second entity node comprises anapproval of the third set of executable code by the second entity;receiving validation of the third set of executable code from a thirdentity node, wherein validation of the third set of executable code fromthe third entity node comprises an approval of the third set ofexecutable code by the third entity; and deploying the third set ofexecutable code to the distributed ledger based on: 1) validating thethird set of executable code, 2) receiving validation of the third setof executable code from the second entity node, and 3) receivingvalidation of the third set of executable code from the third entitynode.
 12. The computer-implemented method of claim 11, wherein thedistributed ledger is a channel-dependent chained repository, whereindata records of the distributed ledger are assigned to a first privatechannel.
 13. The computer implemented method of claim 11, whereinautomatically executing the second set of executable code furthercomprises transferring a second allocation of the amount of resourcesfrom the first entity to a fourth entity.
 14. The computer implementedmethod of claim 11, wherein the method further comprises providingauthorized access of the distributed server to a non-related third-partyentity.
 15. The computer implemented method of claim 11, wherein thedistributed server hosts a distributed ledger wherein the first set ofexecutable code and the second set of executable code are deployed tothe distributed ledger as smart contracts.